Computing optimal (R,s,S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming
نویسندگان
چکیده
منابع مشابه
Stochastic Constraint Programming with And-Or Branch-and-Bound
Complex multi-stage decision making problems often involve uncertainty, for example, regarding demand or processing times. Stochastic constraint programming was proposed as a way to formulate and solve such decision problems, involving arbitrary constraints over both decision and random variables. What stochastic constraint programming currently lacks is support for the use of factorized probab...
متن کاملAn Optimal Tax Relief Policy with Aligning Markov Chain and Dynamic Programming Approach
Abstract In this paper, Markov chain and dynamic programming were used to represent a suitable pattern for tax relief and tax evasion decrease based on tax earnings in Iran from 2005 to 2009. Results, by applying this model, showed that tax evasion were 6714 billion Rials**. With 4% relief to tax payers and by calculating present value of the received tax, it was reduced to 3108 billion Rials. ...
متن کاملOptimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
A stochastic branch{and{bound technique for the solution of stochastic single{machine tardiness problems with job weights is presented. The technique relies on partitioning the solution space and estimating lower and upper bounds by sampling. For the lower bound estimation, two diierent types of sampling (\within" and \without" the minimization) are combined. Convergence to the optimal solution...
متن کاملA two-stage stochastic programming model for the optimal sizing of hybrid PV/diesel/battery in hybrid electric ship system
Ships play the major role in bulk transportation and they need their special energy system. This paper proposes a stochastic programing method for optimal sizing of a hybrid ship power system with energy storage system (ESS), photovoltaic power (PV) and diesel generator. To account for uncertainties, in this study a two-stage stochastic mixed-integer non-linear programing is used to model the o...
متن کاملNeural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree
In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2021
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2021.01.012